Caching and Lemmaizing in Model Elimination Theorem Provers
نویسندگان
چکیده
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we report on work done to modify a model elimination theorem prover using two techniques, caching and lemmaizing, that have reduced by more than an order of magnitude the time required to find proofs of several problems and that have enabled the prover to prove theorems previously unobtainable by top-down model elimination theorem provers.
منابع مشابه
On Semantic Resolution with Lemmaizing and Contraction
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies prevent redundant search by using lemmaizing and caching, whereas contraction-based strategies prevent redundant search by using contraction rules, such as subsumption. In this work we show that lemmaizing and contraction can coexist in the framework of semantic resolution. On the lemmai...
متن کاملCooperation Between Top-Down and Bottom-Up Theorem Provers by Subgoal Clause Transfer
Top-down and bottom-up theorem proving approaches have each specific advantages and disadvantages. Bottom-up provers profit from strong redundancy control and suffer from the lack of goal-orientation, whereas top-down provers are goal-oriented but have weak calculi when their proof lengths are considered. In order to integrate both approaches our method is to achieve cooperation between a top-d...
متن کاملTheorem Provers Based on the Quantifier Elimination Method
Here we describe quantifier elimination based theorem provers that were developed in GIS Group for Inteligent Systems on the Faculty of Mathematics, University of Belgrade; Specially, we present CRACKEN theorem prover for monadic logic, with potential applications.
متن کاملAntilemmas for Model Elimination
We introduce an optimization for model elimination (ME). An antilemma contains information about a failed search for a sub-proof. The application of antilemmas replaces unnecessary search attempts which can extremely improve the eeciency of the ME procedure. An-tilemma application works with other optimizations like lemmaizing and identical-ancestor pruning. We deene several reenements for the ...
متن کاملModular Redundancy for Theorem Proving
We introduce a notion of modular redundancy for theorem proving. It can be used to exploit redundancy elimination techniques (like tautology elimination, subsumption, demodulation or other more reened methods) in combination with arbitrary existing theorem provers, in a refutation complete way, even if these provers are not (or not known to be) complete in combination with the redundancy techni...
متن کامل